Minimax approximations subject to a constraint

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knapsack Cover Subject to a Matroid Constraint

We consider the Knapsack Covering problem subject to a matroid constraint. In this problem, we are given an universe U of n items where item i has attributes: a cost c(i) and a size s(i). We also have a demand D. We are also given a matroid M = (U, I) on the set U . A feasible solution S to the problem is one such that (i) the cumulative size of the items chosen is at least D, and (ii) the set ...

متن کامل

Minimax Bounds for Autoregressive Approximations

The subject of this paper is autoregressive AR approximations of a stationary Gaus sian discrete time process based on a nite sequence of observations We adopt the non parametric minimax framework and study how well can the process be approximated by a nite order autoregressive model Our results show that a properly chosen model dimen sion leads to an optimal in order minimax estimator

متن کامل

A numerical approach to variational problems subject to convexity constraint

We describe an algorithm to approximate the minimizer of an elliptic functional in the form ∫ Ω j(x, u,∇u) on the setC of convex functions u in an appropriate functional spaceX . Such problems arise for instance in mathematical economics [4]. A special case gives the convex envelope u∗∗ 0 of a given function u0. Let (Tn) be any quasiuniform sequence of meshes whose diameter goes to zero, and In...

متن کامل

Nonparametric Multivariate Regression Subject to Constraint

We review Hildreth's algorithm for computing the least squares regression subject to inequality constraints and Dykstra's generalization. We provide a geometric proof of convergence and several ehancements to the algorithm and generalize the application of the algorithm from convex cones to convex sets.

متن کامل

Fast Color Space Transformations Using Minimax Approximations

Color space transformations are frequently used in image processing, graphics, and visualization applications. In many cases, these transformations are complex nonlinear functions, which prohibits their use in time-critical applications. In this paper, we present a new approach called Minimax Approximations for Color-space Transformations (MACT). We demonstrate MACT on three commonly used color...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1971

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1971-0303176-x